es:ES, Cmd:Type, In:AbsInterface(Cmd), isupdate:(Cmd), Sys, Out:AbsInterface(Top).
(E(In) r E(Sys))
 (f:sys-antecedent(es;Sys), chain:(E(Sys)(Id List)).
 chain-consistent(f;chain)  (x, y, z:Id. x << y  y << z  x << z)) 

latex

Up	abstract chain replication
Definitions	P  Q, L1  L2, Id, f(a), x << y, #$n, ||as||, (x  l), {i..j}, e c e', e  X, E, x. t(x), x.A(x), pred(e), <a, b>, A, first(e), suptype(S; T), S  T, x:A.B(x), !Void(), x,y. t(x;y), pred!(e;e'), , SWellFounded(R(x;y)), constant_function(f;A;B), e < e', r  s, val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), , Msg(M), kind(e), loc(e), Knd, kindcase(k; a.f(a); l,t.g(l;t) ), EOrderAxioms(E; pred?; info), IdLnk, Unit, EqDecider(T), strong-subtype(A;B), , a:A fp B(a), EState(T), type List, sys-antecedent(es;Sys), Top, , AbsInterface(A), Type, ES, x:A. B(x), {x:A| B(x)} , Atom$n, chain-consistent(f;chain), hd(l), b, adjacent(T;L;x;y), s = t, P  Q, no_repeats(T;l), a < b, P & Q, x:A  B(x), x:A. B(x), x:AB(x), E(X), x before y  l, t  T, left + right, {T}, increasing(f;k)
Lemmas	l before transitivity, l before sublist, event system wf, subtype rel wf, EState wf, Id wf, rationals wf, member wf, strongwellfounded wf, pred! wf, unit wf, top wf, first wf, assert wf, not wf, loc wf, constant function wf, IdLnk wf, kindcase wf, Knd wf, bool wf, qle wf, cless wf, val-axiom wf, nat wf, Msg wf, kind wf, EOrderAxioms wf, deq wf, es-E wf, es-is-interface wf, es-E-interface wf, es-interface wf, sys-antecedent wf, es-causle wf, chain-consistent wf, l before wf